Generating Hexahedron-Dominant Mesh Based on Shrinking-Mapping Method

Weidong Min Abstract. This paper presents an algorithm based on shrunken polyhedron and mapping to mesh a convex polyhedron using mixed elements, with mostly hexahedra, but including some tetrahedra, pyramids, and wedges. It is part of a scheme for automatically meshing an arbitrary 3D geometry. The scheme rst decomposes a 3D geometry into a set of convex polyhedra. Then the boundary quadrilateral meshes of these convex polyhedra are formed. For every convex polyhedron, the algorithm proposed in this paper generates shrunken polyhedra one by one and uses hexahedron, wedge, pyramid and tetrahedron to ll between two adjacent polyhedra. The 2D boundary meshes of a convex polyhedron are mapped to the boundary polygons of the shrunken polyhedron. The mixed hexahedron mesh are generated based on the mapping relations and on the ending cases for the 2D meshes without direct mapping relation. keywords. hexahedron-dominant mesh, shrinking polyhedron, mapping method, ending case